22
References
1) G. Linden, B. Smith and J. York, "Amazon.com recommendations: ite m-to-item collaborative filtering," in IEEE Internet Computing,
vol. 7, no. 1, pp. 76-80, Jan.-Feb. 2003, doi: 10.1109/MIC.2003.1167344.
2) B. K. Bhavitha, A. P. Rodrigues and N. N. Chiplunkar, "Comparative study of machine learning techniques in sentiment al analysis,"
2017 International Conference on Inventive Communication and Computational Technologies (ICICCT), Coimbatore, 2017, pp. 216-
221, doi: 10.1109/ICICCT.2017.7975191.
3) D. N. Wu, Q. Q. Gan and X. M. Wang, "Verifiable Public Key Enc ryption With Keyword Search Based on H omomorphic
Encryption in Multi-User Setting," in IEEE Access, vol. 6, pp. 42445-42453, 2018, doi: 10.1109/ACCESS .2018.2861424.
4) https://www.geeksforgeeks.org/vigenere-cipher/
5) Rivest, R.; Shamir, A.; Adleman, L. (February 1978). "A Method for Obtaining Digital Signatures and Public-Key
6) E.W Dijkstra, “A note on two problems in connection with graphs” Numerische Mathematik, vol. 1 , pp. 269–271, 1959.
7) T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, "Dijkstra's al gorithm ". Introduction to Algorithms, 2nd ed., MIT Press and
McGraw–Hill. pp. 595–601, 2001, ISBN 0-262-03293-7.
8) T. Porter and I. Simo n, "Random insertion into a priority queue structure". IEEE Transactions on Software Engineerin g. SE-1 (3),
292–298, 1975, doi:10.1109/TSE.1975.6312854
9) T.B. de Silveira, E. M. Duque, S.J.F. Guimarães, H. T. Marques-Neto and H. C. de Freitas, “Proposal of Fibonacci heap in the
Dijkstra algorithm for low-power ad-hoc mobile transmissions”. IEEE Latin America Transactions, vol. 18, issue 3, pp. 623-630, 2020,
doi:10.1109/TLA.2020.9082735
10) L. Chen, J. Zhou, J. Li and Y. Chen, “Bidirectional Dijkstra algorithm for best-routing of urban traffic network”. Proceedings SP IE,
vol. 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 675418 , 2007,
https://doi.org/10.1117/12.764679.